Percolation critical exponents in scale-free networks.
نویسندگان
چکیده
We study the behavior of scale-free networks, having connectivity distribution P(k) approximately k(-lambda), close to the percolation threshold. We show that for networks with 34.
منابع مشابه
Structural Properties of Scale-Free Networks
Many networks have been reported recently to follow a scale-free degree distribution in which the fraction of sites having k connections follows a power law: P (k) = k . In this chapter we study the structural properties of such networks. We show that the average distance between sites in scale-free networks is much smaller than that in regular random networks, and bears an interesting dependen...
متن کاملCore percolation on complex networks
We analytically solve the core percolation problem for complex networks with arbitrary degree distributions. We find that purely scale-free networks have no core for any degree exponents. We show that for undirected networks if core percolation occurs then it is continuous while for directed networks it is discontinuous (and hybrid) if the in- and out-degree distributions differ. We also find t...
متن کاملPercolation in directed scale-free networks.
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in and out degree distributions. We derive a phase diagram that indicates the existence of three regimes, determined by the values of the degree exponents. In the first regi...
متن کاملBreaking of the site-bond percolation universality in networks
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system. Percolation has always been regarded as a substrate-dependent but model-independent process, in the sense that the critical exponents of the transition are det...
متن کاملBiased percolation on scale-free networks.
Biased (degree-dependent) percolation was recently shown to provide strategies for turning robust networks fragile and vice versa. Here, we present more detailed results for biased edge percolation on scale-free networks. We assume a network in which the probability for an edge between nodes i and j to be retained is proportional to (k(i)k(j)(-alpha) with k(i) and k(j) the degrees of the nodes....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 66 3 Pt 2A شماره
صفحات -
تاریخ انتشار 2002